Valuations and closure operators on finite lattices
نویسندگان
چکیده
منابع مشابه
Complete Valuations on Finite Distributive Lattices
We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are downset lattices of finite posets of dimension at most two, and determine a realizer through a recursive relation between weights on the poset associated to...
متن کاملClosure operators on sets and algebraic lattices
Closure operators are abundant in mathematics; here are a few examples. Given an algebraic structure, such as group, ring, field, lattice, vector space, etc., taking the substructure generated by a set, i.e., the least substructure which includes that set, is a closure operator. Given a binary relation, taking the relation with certain properties, such as reflexive, transitive, equivalence, etc...
متن کاملClosure Operators in Almost Distributive Lattices
The concept of a closure operator ∇ in an ADL R was introduced. If ∇R is the set of all ∇−invariant elements of R, then the concepts of ∇R−ideal, ∇R−prime ideal are introduced. The interrelations between ∇R−prime ideal and minimal prime ideal of R are derived. If B is the Birkhoff centre of R, then a sufficient condition is derived for a B−ideal to be a minimal prime ideal of R. Mathematics Sub...
متن کاملValuations on Lattices: Fuzzification and its Implications
The notion of ordering is perhaps one of the most fundamental of abstract concepts. The zeta function is used to algebraically describe the ordering of elements in a lattice. An appropriate generalization of the zeta function generalizes the notion of inclusion to degrees of inclusion. However, the lattice structure imposes strong constraints on the values that these degrees can take. Here we r...
متن کاملSome lattices of closure systems on a finite set
In this paper we study two lattices of significant particular closure systems on a finite set, namely the union stable closure systems and the convex geometries. Using the notion of (admissible) quasi-closed set and of (deletable) closed set we determine the covering relation ≺ of these lattices and the changes induced, for instance, on the irreducible elements when one goes from C to C ′ where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.11.022